<html>
 <head>
  <link href="./leetcode-problem.css" rel="stylesheet" type="text/css">
 </head>
 <body>
  <div class="question_difficulty">
   难度：Medium
  </div>
  <div>
   <h1 class="question_title">
    513. Find Bottom Left Tree Value
   </h1>
   <p>
    Given a binary tree, find the leftmost value in the last row of the tree.
   </p>
   <p>
    <b>
     Example 1:
    </b>
    <br>
   </p>
   <pre>
Input:

    2
   / \
  1   3

Output:
1
</pre>
   <p>
    <b>
     Example 2:
    </b>
    <br>
   </p>
   <pre>
Input:

        1
       / \
      2   3
     /   / \
    4   5   6
       /
      7

Output:
7
</pre>
   <p>
    <b>
     Note:
    </b>
    You may assume the tree (i.e., the given root node) is not
    <b>
     NULL
    </b>
    .
   </p>
  </div>
  <div>
   <h1 class="question_title">
    513. 找树左下角的值
   </h1>
   <p>
    给定一个二叉树，在树的最后一行找到最左边的值。
   </p>
   <p>
    <strong>
     示例 1:
    </strong>
   </p>
   <pre>
<strong>输入:</strong>

    2
   / \
  1   3

<strong>输出:</strong>
1
</pre>
   <p>
    &nbsp;
   </p>
   <p>
    <strong>
     示例 2:
    </strong>
   </p>
   <pre>
<strong>输入:</strong>

        1
       / \
      2   3
     /   / \
    4   5   6
       /
      7

<strong>输出:</strong>
7
</pre>
   <p>
    &nbsp;
   </p>
   <p>
    <strong>
     注意:
    </strong>
    您可以假设树（即给定的根节点）不为
    <strong>
     NULL
    </strong>
    。
   </p>
  </div>
 </body>
</html>